package LeetCode;

import org.junit.Test;

import java.util.Arrays;

/**
 * // https://leetcode-cn.com/problems/house-robber/ 动态规划
 */

public class LC198 {
    public int rob(int[] nums) {
        if(nums.length ==0) return 0;
        if(nums.length==1) return nums[0];
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0],nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i-2]+nums[i],dp[i-1]);
        }
        return dp[nums.length-1];
    }

    @Test
    public void t1(){
        int[] ints = {1, 2, 3, 3};
        int[] ints1 = Arrays.copyOfRange(ints, 0, ints.length);
        System.out.println(Arrays.toString(ints1));
    }

}